Comparison of PS, SRPT, and FB Scheduling Policies under Exponential and Heavy Tail Job Sizes
نویسندگان
چکیده
We present numerical analysis that campares the performances of PS, SRPT , and FB scheduling polcies in terms of their conditional mean response times in an M/G/1 model, where G represents an exponential job size distribution or a job size distribution with highly varying sizes such as heavy tailed distribution. The results show that for heavy tailed job size distribution, FB offers mean slowdown close to SRPT and a small percentage of the largest jobs experiences a higher slowdown under FB than under PS.
منابع مشابه
Heavy-Tailed Limits for Medium Size Jobs and Comparison Scheduling
We study the conditional sojourn time distributions of processor sharing (PS), foreground background processor sharing (FBPS) and shortest remaining processing time first (SRPT) scheduling disciplines on an event where the job size of a customer arriving in stationarity is smaller than exactly k ≥ 0 out of the preceding m ≥ k arrivals. Then, conditioning on the preceding event, the sojourn time...
متن کاملQuantifying the Properties of SRPT Scheduling
This paper uses a probe-based sampling approach to study the behavioural properties of Web server scheduling strategies, such as Processor Sharing (PS) and Shortest Remaining Processing Time (SRPT). The approach is general purpose, in that it can be used to estimate the mean and variance of the job response time, for arbitrary arrival processes, scheduling policies, and service time distributio...
متن کاملScheduling Solutions for Coping with Transient Overload 1
For most computer systems, even short periods of overload degrade performance signi cantly. The number of jobs in the system quickly grows, often exceeding the capacity of the system within just seconds, and response times explode. In this paper we investigate system behavior under transient overload. We nd that the poor behavior of systems under transient overload can at least partly be attrib...
متن کاملRevisiting unfairness in Web server scheduling
This paper uses trace-driven simulation to study the unfairness properties of Web server scheduling strategies, such as Processor Sharing (PS) and Shortest Remaining Processing Time (SRPT). We use a general-purpose probe-based sampling approach to estimate the mean and variance of the job response time for different job sizes, for arbitrary arrival processes and service time distributions. The ...
متن کاملIs Tail-Optimal Scheduling Possible?
This paper focuses on the competitive analysis of scheduling disciplines in a large deviations setting. Though there are policies that are known to optimize the sojourn time tail under a large class of heavy-tailed job sizes (e.g. Processor Sharing and Shortest Remaining Processing Time) and there are policies known to optimize the sojourn time tail in the case of light-tailed job sizes (e.g. F...
متن کامل